Does backwards induction imply subgame perfection?

نویسندگان

  • Carlos Alós-Ferrer
  • Klaus Ritzberger
چکیده

In finite games subgame perfect equilibria are precisely those that are obtained by a backwards induction procedure. In large extensive form games with perfect information this equivalence does not hold: Strategy combinations fulfilling the backwards induction criterion may not be subgame perfect in general. The full equivalence is restored only under additional (topological) assumptions. This equivalence is in the form of a one-shot deviation principle for large games, which requires lower semi-continuous preferences. As corollaries we obtain one-shot deviation principles for particular classes of games, when each player moves only finitely often or when preferences are representable by payoff functions that are continuous at infinity.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Uniqueness of the index for Nash equilibria of two-player games

A basic problem of game theory is equilibrium selection; that is, identifying those equilibria that satisfy plausible axioms of the sort postulated by Kohlberg and Mertens (1986) and Mertens (1989), and variants proposed by Banks and Sobel (1987), Cho and Kreps (1987), and others. The main axioms require properties such as Invariance (with respect to addition or deletion of redundant pure strat...

متن کامل

The Dynamic (In)Stability of Backwards Induction1

The evolutionary basis for predicting the backwards induction solution in generic ̄nite extensive-form games with perfect information is examined. Evolution is modelled using the replicator dynamic in combination with rare mutations that introduce a small change in the proportion of each strategy. The criterion for our judgement is whether this dynamic stabilizes over time at the subgame perfec...

متن کامل

VERY PRELIMINARY VERSION COMMENTS WELCOME A Notion of Subgame Perfect Nash Equilibrium under Knightian Uncertainty by

We define a subgame perfect Nash equilibrium under Knightian uncertainty for two players, by means of a recursive backward induction procedure. We prove an extension of the Zermelo-von Neumann-Kuhn Theorem for games of perfect information, i. e., that the recursive procedure generates a Nash equilibrium under uncertainty (Dow and Werlang(1994)) of the whole game. We apply the notion for two wel...

متن کامل

Backward Induction and Subgame Perfection . The justi fi cation of a “ folk algorithm . ”

I introduce axiomatically infinite sequential games that extend von Neumann and Kuhn’s classic axiomatic frameworks. Within this setup, I define a modified backward induction procedure that is applicable to all games. A strategy profile that survives backward pruning is called a backward induction equilibrium (BIE). The main result compares the sets of BIE and subgame perfect equilibria (SPE). ...

متن کامل

Testing Subgame Perfection Apart From Fairness in Ultimatum Games∗

We present an experiment that attempts to separate the two commonplace explanations for behavior in ultimatum games–subjects’ concern for fairness versus the failure of subgame perfection as an equilibrium refinement. We employ a tournament structure of the bargaining interaction to eliminate the potential for fairness to influence behavior. Comparing the results of the tournament game with two...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Games and Economic Behavior

دوره 103  شماره 

صفحات  -

تاریخ انتشار 2017